A Search For Solvable Weighing Matrices: supporting documents

نویسندگان

  • Paul E. Becker
  • Sheridan Houghten
  • Wolfgang Haas
چکیده

This file contains additional information relating to the article: “A Search for Solvable Weighing Matrices,” submitted to Journal of Combinatorial Mathematics and Combinatorial Computing Feb. 25, 2005. In that article, we describe a computer search for group-developed weighing matrices of order 60 and weight 25, which we abbreviate as W (60, 25). Generally speaking, we view weighing matrices as polynomials in a rational group ring QG. We restrict the search space for these polynomials by correlating projections into quotient group rings Q(G/N) for various normal subgroups, N . We call the projection of a weighing matrix polynomial into Q(G/N) a G/N quotient image. Due to restrictions on space, the submitted article leaves out many details of the computation of small quotient images. That information is included in this file, along with relevant information about the structure of groups of order 60.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Investigation of Perfect Ternary Arrays PTA ( 60 , 25 )

Perfect ternary arrays are closely related to difference sets and group invariant weighing matrices. A previous paper by one of the authors demonstrated strong restrictions on difference sets with parameters (120, 35, 10). A perfect ternary array with energy 25 and order 60 – PTA(60,25) – would obey an equation analogous to the difference set equation for (120, 35, 10). A perfect ternary array ...

متن کامل

Some New Results on Circulant Weighing Matrices

We obtain a few structural theorems for circulant weighing matrices whose weight is the square of a prime number. Our results provide new schemes to search for these objects. We also establish the existence status of several previously open cases of circulant weighing matrices. More specifically we show their nonexistence for the parameter pairs (n, k) (here n is the order of the matrix and k i...

متن کامل

Weighing Matrices and String Sorting

In this paper we establish a fundamental link between the search for weighing matrices constructed from two circulants and the operation of sorting strings, an operation that has been studied extensively in computer science. In particular, we demonstrate that the search for weighing matrices constructed from two circulants using the power spectral density criterion and exploiting structural pat...

متن کامل

A GUIDED TABU SEARCH FOR PROFILE OPTIMIZATION OF FINITE ELEMENT MODELS

In this paper a Guided Tabu Search (GTS) is utilized for optimal nodal ordering of finite element models (FEMs) leading to small profile for the stiffness matrices of the models. The search strategy is accelerated and a graph-theoretical approach is used as guidance. The method is evaluated by minimization of graph matrices pattern equivalent to stiffness matrices of finite element models. Comp...

متن کامل

An Improved K-Nearest Neighbor with Crow Search Algorithm for Feature Selection in Text Documents Classification

The Internet provides easy access to a kind of library resources. However, classification of documents from a large amount of data is still an issue and demands time and energy to find certain documents. Classification of similar documents in specific classes of data can reduce the time for searching the required data, particularly text documents. This is further facilitated by using Artificial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005